Scheduling of Independent Dedicated Multiprocessor Tasks
نویسندگان
چکیده
We study the offline and online versions of the well known problem of scheduling a set of n independent multiprocessor tasks with prespecified processor allocations on a set of identical processors in order to minimize the makespan. Recently, in [13], it has been proven that in the case when all tasks have unit processing time the problem cannot be approximated within a factor of m 1 2 ε, neither for some ε> 0, unless P= NP; nor for any ε> 0, unless NP=ZPP. For this special case we give a simple algorithm based on the classical first-fit technique. We analyze the algorithm for both tasks arrive over time and tasks arrive over list online scheduling versions, and show that its competitive ratio is bounded by 2 p m and 2 p m+1, respectively. Here we also use some preliminary results on (vertex) coloring of k-tuple graphs. For the case of arbitrary processing times, we show that any algorithm which uses the first-fit technique cannot be better than m competitive. Then, by using our split-round technique, we give a 3 p m-approximation algorithm for the offline version of the problem. Finally, by using some ideas from [21], we adapt the algorithm to the online case, in the paradigm of tasks arriving over time in which the existence of a task is unknown until its release date, and show that its competitive ratio is bounded by 6 p m. Due to the conducted experimental results, we conclude that our algorithms can perform well in practice.
منابع مشابه
Scheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملDeadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times
This paper presents a scheduling technique used to optimize computation speed of loops running on architectures that may include pipelined dedicated processors. The problem under consideration is to find an optimal periodic schedule satisfying the timing constraints. Motivated by FPGA (Field-Programmable Gate Array) architecture we formulate a problem of cyclic scheduling on one dedicated proce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002